Pancyclicity of hamiltonian line graphs
نویسندگان
چکیده
Let f(n) be the smallest integer such that for every graph G of order n with minimum degree 3(G)>f(n), the line graph L(G) of G is pancyclic whenever L(G) is hamiltonian. Results are proved showing that f(n) = ®(n 1/3).
منابع مشابه
A New Chvátal Type Condition for Pancyclicity
Schmeichel and Hakimi ?], and Bauer and Schmeichel ?] gave an evidence in support of the well-known Bondy's "metaconjecture" that almost any non-trivial condition on graphs which implies that the graph is hamiltonian also implies that it is pancyclic. In particular, they proved that the metaconjecture is valid for Chvv atal's condition ?]. We slightly generalize their results giving a new Chvv ...
متن کاملForbidden Subgraphs and Pancyclicity
We prove that every 2{connected K 1;3-free and Z 3 ?free graph is hamiltonian except for two graphs. Furthermore, we give a complete characterization of all 2?connected, K 1;3-free graphs, which are not pancyclic, and which are Z 3-free, B-free, W-free, or HP 7 ?free.
متن کاملA Generalization of Dirac's Theorem for K(1,3)-free Graphs
It is known that ff a 2-connected graph G of suiBciently large order n satisfies the property that the union of the neighborhoods of each pair of vertices has cardinallty at least ~-, " then G is hamiltonian. In this paper, we obtain a similar generalization of Dirac's Theorem for K(1, 3)-free graphs. In particular, we show that if G is a 2-connected K(1, 3)-free graph of order n with the cardi...
متن کاملClosure and stable Hamiltonian properties in claw-free graphs
In the class of k-connected claw-free graphs, we study the stability of some hamilto-nian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these properties there is an innnite family of graphs G k of arbitrarily high connectivity k such tha...
متن کاملPairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
A graph G on n vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to n. In 1984, Fan presented a degree condition involving every pair of vertices at distance two for a 2-connected graph to be Hamiltonian. Motivated by Fan’s result, we say that an induced subgraph H of G is f1-heavy if for every pair of vertices u, v ∈ V (H), dH(u,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 138 شماره
صفحات -
تاریخ انتشار 1995